Homotopical Methods for Theoretical Computer Science
نویسنده
چکیده
The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author’s paper “A model category for the homotopy theory of concurrency”. It is presented generalizations of the classical Whitehead theorem inverting weak homotopy equivalences between CW-complexes using weak factorization systems. It is also presented methods of calculation of homotopy limits and homotopy colimits using Quillen adjunctions and Reedy categories.
منابع مشابه
Algebra and Geometry of Rewriting
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduced by Albert Burroni) and polygraphic resolutions (introduced by François Métayer). There are two motivations for such a theory: • providing invariants of computational systems to study those systems and prove propertie...
متن کاملUnivalence for inverse diagrams and homotopy canonicity
We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory. This has two main applications. First, by considering inverse diagrams in Voevodsky...
متن کاملHigher-dimensional categories with finite derivation type
We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalising the one introduced by Squier for word rewriting systems. We characterise this property by using the notion of critical branching. In particular, we define sufficient conditions f...
متن کاملConditionally flat functors on spaces and groups
Consider a fibration sequence F → E → B of topological spaces which is preserved as such by some functor L, so that LF → LE → LB is again a fibration sequence. Pull the fibration back along an arbitrary map X → B into the base space. Does the pullback fibration enjoy the same property? For most functors this is not to be expected, and we concentrate mostly on homotopical localization functors. ...
متن کاملHomological Computations for Term Rewriting Systems
An important problem in universal algebra consists in finding presentations of algebraic theories by generators and relations, which are as small as possible. Exhibiting lower bounds on the number of those generators and relations for a given theory is a difficult task because it a priori requires considering all possible sets of generators for a theory and no general method exists. In this art...
متن کامل